Ju. A. Schreider, Equality, Resemblance and Order

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Patterns of resemblance of order 2

We will investigate patterns of resemblance of order 2 over a family of arithmetic structures on the ordinals. In particular, we will show that they determine a computable well ordering under appropriate assumptions. This paper continues the investigation into the patterns formed by embeddings between initial segments of structures on the ordinals. The goals are twofold: to eventually find an u...

متن کامل

Equality and Monodic First-Order Temporal Logic

It has been shown recently that monodic first-order temporal logic without functional symbols but with equality is incomplete, i.e. the set of the valid formulae of this logic is not recursively enumerable. In this paper we show that an even simpler fragment consisting of monodic monadic two-variable formulae is not recursively enumerable.

متن کامل

Parametricity, type equality, and higher-order polymorphism

Propositions that express type equality are a frequent ingredient of modern functional programming—they can encode generic functions, dynamic types, and GADTs. Via the Curry-Howard correspondence, these propositions are ordinary types inhabited by proof terms, computed using runtime type representations. In this paper we show that two examples of type equality propositions actually do reflect t...

متن کامل

Order-Sorted Equality Enrichments Modulo Axioms

Built-in equality and inequality predicates based on comparison of canonical forms in algebraic specifications are frequently used because they are handy and efficient. However, their use places algebraic specifications with initial algebra semantics beyond the pale of theorem proving tools based, for example, on explicit or inductionless induction techniques, and of other formal tools for chec...

متن کامل

Anti-symmetry of higher-order subtyping and equality by subtyping

This paper gives the first proof that the subtyping relation of a higherorder lambda calculus, F ≤, is anti-symmetric, establishing in the process that the subtyping relation is a partial order—reflexive, transitive, and anti-symmetric up to β-equality. While a subtyping relation is reflexive and transitive by definition, anti-symmetry is a derived property. The result, which may seem obvious t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Crítica (México D. F. En línea)

سال: 1979

ISSN: 1870-4905,0011-1503

DOI: 10.22201/iifs.18704905e.1979.301